Betweenness, Lukasiewicz Rough Inclusions, Euclidean Representations in Information Systems, Hyper-granules, Conflict Resolution
نویسنده
چکیده
The purpose of this note is to augment information systems with a relation of betweenness among things in the universe of the system and derive from it a geometric representation of granules of things in Euclidean spaces. Next, the notion of betweenness renders a service in introducing a new notion of a hyper– granule. An application to conflict resolution by defining coalitions of agents as granules or hyper–granules and their mixed strategies as elements of convex hulls spanned on things defining the granule is proposed. Finally, hyper–granules offer a new classifying algorithm which exploits neighborhoods of things and in a sense is an improved with respect to similarity variant of nearest neighbor classifier.
منابع مشابه
Rough 3-valued algebras
Rough set theory is an important tool for dealing with granularity and vagueness in information systems. This paper studies a kind of rough set algebra. The collection of all the rough sets of an approximation space can be made into a 3-valued Lukasiewicz algebra. We call the algebra a rough 3-valued Lukasiewicz algebra. In this paper, we focus on the rough 3-valued Lukasiewicz algebras, which ...
متن کاملApproximate Reasoning in MAS: Rough Set Approach Extended Abstract
In modeling multiagent systems for real-life problems, techniques for approximate reasoning about vague concepts and dependencies (ARVCD) are necessary. We discuss an approach to approximate reasoning based on rough sets. In particular, we present a number of basic concepts such as approximation spaces, concept approximation, rough inclusion, construction of information granules in calculi of i...
متن کاملAn Overview of Granular Computing Using Fuzzy Logic Systems
As Granular Computing has gained interest, more research has lead into using different representations for Information Granules, i.e., rough sets, intervals, quotient space, fuzzy sets; where each representation offers different approaches to information granulation. These different representations have given more flexibility to what information granulation can achieve. In this overview paper, ...
متن کاملA Review of the Knowledge Granulation Methods: Discrete vs. Continuous Algorithms
The paradigm of granular rough computing has risen quite recently — was initiated by Professor Lotfi Zadeh in 1979. This paradigm is strictly connected with the Rough Set Theory, which was proposed by Professor Zdzisław Pawlak in 1982. Granular rough computing is a paradigm in which one deals with granules that are aggregates of objects connected together by some form of similarity. In the roug...
متن کاملOn Granular Rough Computing with Missing Values
Granular Computing as a paradigm in Approximate Reasoning is concerned with granulation of available knowledge into granules that consists of entities similar with respect to a chosen measure in information content and with computing on such granules. Thus, operators acting on entities in a considered universe should factor through granular structures giving values similar to values of same ope...
متن کامل